a new approach to solve multiple objective programming problems

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the feasible region via stepwise movements and a plain continuous interaction with decision maker (dm). we consider the case where all objective functions and constraints are linear. the implementation of the proposed algorithm is demonstrated with two numerical examples.